An ASM Refinement and Implementation of the Condor System using Ordinal Conditional Functions
نویسندگان
چکیده
A high-level ASM specification of Condor, a system providing powerful methods for managing beliefs induced by general conditionals, is refined to qualitative conditional logics, leading to an ASM implementation. The semantics of this logic are given by ordinal conditional functions (OCFs) ordering worlds according to their plausibility. OCFs are used to represent the epistemic state of an agent carrying out knowledge management tasks like answering queries, performing diagnosis and hypothetical reasoning, or revising and updating its own state of belief in the light of new information. The ASM methodology allows us to precisely describe these knowledge management operations and clarify various subtleties.
منابع مشابه
Modelling Conditional Knowledge Discovery and Belief Revision by Abstract State Machines
We develop a high-level ASM specification for the Condor system that provides powerful methods and tools for managing knowledge represented by conditionals. Thereby, we are able to elaborate crucial interdependencies between different aspects of knowledge representation, knowledge discovery, and belief revision. Moreover, this specification provides the basis for a stepwise refinement developme...
متن کاملOn the Modelling of an Agent's Epistemic State and its Dynamic Changes
Given a set of unquantified conditionals considered as default rules or a set of quantified conditionals such as probabilistic rules, an agent can build up its internal epistemic state from such a knowledge base by inductive reasoning techniques. Besides certain (logical) knowledge, epistemic states are supposed to allow the representation of preferences, beliefs, assumptions etc. of an intelli...
متن کاملA Novel Approach to Conditional Random Field-based Named Entity Recognition using Persian Specific Features
Named Entity Recognition is an information extraction technique that identifies name entities in a text. Three popular methods have been conventionally used namely: rule-based, machine-learning-based and hybrid of them to extract named entities from a text. Machine-learning-based methods have good performance in the Persian language if they are trained with good features. To get good performanc...
متن کاملTransmutations of Knowledge Systems
Within the AGM paradigm revision and contraction operators are constrained by a set of rationality postulates. The logical properties of a set of knowledge are not strong enough to uniquely determine a revision or contraction operation, therefore constructions for these operators rely on some form of underlying preference relation, such as a systems of spheres, or an epistemic entrenchment orde...
متن کاملA Case Study on Model Checking and Refinement of Abstract State Machines
State Machines (ASMs) [6] are used for specifying wide ranges of applications in a high abstraction level. ASMs bring together specification methods and computational models. Thus, they are a successful methodology for validating and verifying any system. On the other hand, model checking [4] has been proven to be a valuable approach for automatic formal verification. In spite of the successful...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007